MOrphologically-Aware Jaccard-Based ITerative Optimization (MOJITO) for Consensus Segmentation

نویسندگان

چکیده

The extraction of consensus segmentations from several binary or probabilistic masks is important to solve various tasks such as the analysis inter-rater variability fusion neural network outputs. One most widely used method obtain a segmentation STAPLE algorithm. In this paper, we first demonstrate that output algorithm heavily impacted by background size images and choice prior. We then propose new construct based on Fréchet means Jaccard distances which make it totally independent image size. provide heuristic approach optimize criteria voxel’s class fully determined its morphological distance, connected component belongs group raters who segmented it. compared extensively our three datasets with naive averaging method, showing leads intermediate between Majority Voting different posterior probabilities than those methods. Codes are available at https://gitlab.inria.fr/dhamzaou/jaccardmap .

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stencil-Aware GPU Optimization of Iterative Solvers

Numerical solutions of nonlinear partial differential equations frequently rely on iterative Newton-Krylov methods, which linearize a finite-difference stencil-based discretization of a problem, producing a sparse matrix with regular structure. Knowledge of this structure can be used to exploit parallelism and locality of reference on modern cache-based multiand manycore architectures, achievin...

متن کامل

Optimization of the Jaccard index for image segmentation with the Lovász hinge

The Jaccard loss, commonly referred to as the intersection-over-union loss, is commonly employed in the evaluation of segmentation quality due to its better perceptual quality and scale invariance, which lends appropriate relevance to small objects compared with per-pixel losses. We present a method for direct optimization of the per-image intersection-over-union loss in neural networks, in the...

متن کامل

Protocol-Aware Recovery for Consensus-Based Storage

We introduce protocol-aware recovery (PAR), a new approach that exploits protocol-specific knowledge to correctly recover from storage faults in distributed systems. We demonstrate the efficacy of PAR through the design and implementation of corruption-tolerant replication (CTRL), a PAR mechanism specific to replicated state machine (RSM) systems. We experimentally show that the CTRL versions o...

متن کامل

Entropy-based Consensus for Distributed Data Clustering

The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...

متن کامل

Independent feature subspace iterative optimization based fuzzy clustering for synthetic aperture radar image segmentation

Synthetic aperture radar (SAR) image segmentation is investigated from feature extraction to algorithm design, which is characterized by two aspects: (1) multiple heterogeneous features are extracted to describe SAR images and the corresponding similarity measures are developed independently to avoid the mutual influences between different features in order to enhance the discriminability of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2022

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-031-16749-2_1